Setting the Demons Loose: Computational Irreducibility Does Not Guarantee Unpredictability or Emergence

Abstract A phenomenon resulting from a computationally irreducible (or incompressible) process is supposedly unpredictable except via simulation. This notion of unpredictability has been deployed to formulate recent accounts computational emergence. Via technical analysis, I show that irreducibility can establish the impossibility prediction only with respect maximum standards precision. By articulating graded nature prediction, not equivalent being in general. conclude fails fulfill its assigned philosophical roles theories